A Distributed Optimized Patient Scheduling using Partial Information
نویسندگان
چکیده
منابع مشابه
A Distributed Optimized Patient Scheduling using Partial Information
A software agent may be a member of a Multi-Agent System (MAS) which is collectively performing a range of complex and intelligent tasks. In the hospital, scheduling decisions are finding difficult to schedule because of the dynamic changes and distribution. In order to face this problem with dynamic changes in the hospital, a new method, Distributed Optimized Patient Scheduling with Grouping (...
متن کاملDistributed Patient Scheduling in Hospitals
Patient scheduling in hospitals is a highly complex task. Hospitals have a distributed organisational structure; being divided into several autonomous wards and ancillary units. Moreover, the treatment process is dynamic (information about the patients' diseases often varies during treatments, causing changes in the treatment process). Current approaches are insufficient because they either foc...
متن کاملA Message-Optimal Distributed Graph Algorithm: Partial Precedence Constrained Scheduling
This paper presents a distributed algorithm for the partial precedence constrained scheduling problem. In the classical precedence constrained scheduling problem all the dependent tasks must be scheduled before the task itself can be scheduled. The partial precedence constrained scheduling problem is a generalized version of the original precedence constrained problem in the sense that the numb...
متن کاملScheduling Under Fading and Partial Channel Information
We consider a scheduler for the downlink of a wireless channel when only partial channel-state information is available at the scheduler. We characterize the network stability region and provide two throughputoptimal scheduling policies. We also derive a deterministic bound on the mean packet delay in the network. Finally, we provide a throughputoptimal policy for the network under QoS constrai...
متن کاملScheduling with Global Information in Distributed Systems
Buffered coscheduling is a distributed scheduling methodology for time-sharing communicating processes in a distributed system, e.g., PC cluster. The principle mechanisms involved in this methodology are communication buffering and strobing. With communication buffering, communication generated by each processor is buffered and performed at the end of regular intervals (or time slices) to amort...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Artificial Intelligence & Applications
سال: 2012
ISSN: 0976-2191
DOI: 10.5121/ijaia.2012.3307